Search results for "Query optimization"
showing 10 items of 12 documents
A query language for medical statistical analysis
1991
While standard query languages support primarily the definition of single queries, in the evaluation of medical studies one usually formulates large sets of interdependent queries. A set of this type is called an integrated transaction. Our system for the definition of integrated transactions is based on the observation that in medicine a large number of statistical evaluations is founded on a conceptional model that can be structured as a tree. We describe a screen oriented tree editor for the relational data base system DBase and report on our experience with its application in the evaluation of the success rate of PTCA interventions.
Optimizing the Performance of Data Warehouse by Query Cache Mechanism
2022
Fast access of data from Data Warehouse (DW) is a need for today’s Business Intelligence (BI). In the era of Big Data, the cache is regarded as one of the most effective techniques to improve the performance of accessing data. DW has been widely used by several organizations to manage data and use it for Decision Support System (DSS). Many methods have been used to optimize the performance of fetching data from DW. Query cache method is one of those methods that play an effective role in optimization. The proposed work is based on a cache-based mechanism that helps DW in two aspects: the first one is to reduce the execution time by directly accessing records from cache memory, and th…
The visual query language CQL for transitive and relational computation
2000
Abstract Classification query language (CQL) is a high-level visual query language with a great expressive power. In CQL the processing of ordinary relations and classifications based on transitive relationships is integrated seamlessly. Relations and classifications are represented in the visual interface in a uniform way through relation and classification skeletons. All query formulation in CQL is QBE-like – based on the intuitive way of filling constants and sample values into the skeletons. In order to guarantee great expressive power, relational and classification expressions can be nested freely with each other at unlimited nesting levels. Recursive definition of transitive processin…
Towards Graphical Query Notation for Semantic Databases
2015
We describe a notation and a tool for schema-enabled visual/diagrammatic creation of SPARQL queries over RDF databases. The notation and the tool support both the standard basic query pattern comprising a main query class and possibly linked condition classes and means for aggregate query definition and placing conditions over aggregates including also aggregation of aggregate results. We discuss the applicability of the tool for ad-hoc query formulation in practical use cases.
Quantum versus classical query complexity of relation
2011
This paper investigates the computability of mathematical relations in a quantum query model. The important task in complexity theory is to find examples with a large gap between classical and quantum algorithm complexity of the same computational problem. We present new results in quantum query algorithm design that allow achieving a large separation between classical and quantum query complexity of a specific relation. We demonstrate an example where quantum query algorithm for a finite relation needs more than two times fewer queries than the best possible classical analogue. We also show that relation can be extended to infinite family of relations with an input of general size N.
Optimisation des requêtes de similarité dans les espaces métriques répondant aux besoins des usagers
2012
The complexity of data stored in large databases has increased at very fast paces. Hence, operations more elaborated than traditional queries are essential in order to extract all required information from the database. Therefore, the interest of the database community in similarity search has increased significantly. Two of the well-known types of similarity search are the Range (Rq) and the k-Nearest Neighbor (kNNq) queries, which, as any of the traditional ones, can be sped up by indexing structures of the Database Management System (DBMS). Another way of speeding up queries is to perform query optimization. In this process, metrics about data are collected and employed to adjust the par…
On the Power of Non-adaptive Learning Graphs
2012
We introduce a notion of the quantum query complexity of a certificate structure. This is a formalisation of a well-known observation that many quantum query algorithms only require the knowledge of the disposition of possible certificates in the input string, not the precise values therein. Next, we derive a dual formulation of the complexity of a non-adaptive learning graph, and use it to show that non-adaptive learning graphs are tight for all certificate structures. By this, we mean that there exists a function possessing the certificate structure and such that a learning graph gives an optimal quantum query algorithm for it. For a special case of certificate structures generated by cer…
Multiple SIP strategies and bottom-up adorning in logic query optimization
1990
Preprocessing methods called “readorning” and “bottom-up adorning” are introduced as means of enlarging the application domain of magic sets and related query optimization strategies for logic databases. Readorning tries to make possible the simultaneous use of multiple sideways information passing (sip) strategies defined for a rule, thus yielding an optimization effect that may not be achieved by any particular choice of sip strategies. Bottom-up adorning is used to make magic sets applicable to cases in which potential optimizations can be derived from bindings coming upwards from rule bodies to rule heads in bottom-up evaluation. These include the cases in which we know that some base r…
QUEXME: A Query Expansion Method Applied to Water Information System
2009
The aim of the paper is to present and apply a QUery EXpansion MEthod called QUEXME while querying the Euro-Mediterranean Information System (EMWIS) on know-how in the Water sector. EMWIS provides a strategic tool for exchanging information and knowledge in the water sector between and within the Euro Mediterranean partnership countries (www.emwis.net). Information retrieval on the web or through some cooperation of information sources or some general knowledge bases is a complex process and a great challenge with the emergence of the semantic web. The aim of the query expansion method is to help and guide users to build their requests giving them some usually related terms close to their q…
Algebraic Properties to Optimize kNN Queries
2011
International audience; New applications that are being required to employ Database Management Systems (DBMSs), such as storing and retrieving complex data (images, sound, temporal series, genetic data, etc.) and analytical data processing (data mining, social networks analysis, etc.), increasingly impose the need for new ways of expressing predicates. Among the new most studied predicates are the similarity-based ones, where the two commonest are the similarity range and the k-nearest neighbor predicates. The k-nearest neighbor predicate is surely the most interesting for several applications, including Content-Based Image Retrieval (CBIR) and Data Mining (DM) tasks, yet it is also the mos…